No Free Lunch in the Search for Creativity
نویسنده
چکیده
We consider computational creativity as a search process and give a No Free Lunch result for computational creativity in this context. That is, we show that there is no a priori “best” creative strategy. We discuss some implications of this result and suggest some additional questions to be explored.
منابع مشابه
Title Generalization of the no - free - lunch theorem
The No-Free-Lunch (NFL) Theorem provides a fundamental limit governing all optimization/search algorithms and has successfully drawn attention to theoretical foundation of optimization and search. However, we find several limitations in the original NFL paper. In this work, using results from the nature of search algorithms, we enhance several aspects of the original NFL Theorem. We have identi...
متن کاملNo-Free-Lunch theorems in the continuum
No-Free-Lunch Theorems state, roughly speaking, that the performance of all search algorithms is the same when averaged over all possible objective functions. This fact was precisely formulated for the first time in a now famous paper by Wolpert and Macready, and then subsequently refined and extended by several authors, always in the context of a set of functions with discrete domain and codom...
متن کاملSearching Large Spaces: Displacement and the No Free Lunch Regress
Searching for small targets in large spaces is a common problem in the sciences. Because blind search is inadequate for such searches, it needs to be supplemented with additional information, thereby transforming a blind search into an assisted search. This additional information can be quantified and indicates that assisted searches themselves result from searching higher-level search spaces–b...
متن کاملSearch, Binary Representations and Counting Optima
Choosing a good representation is a vital component of solving any search problem. However, choosing a good representation for a problem is as diicult as choosing a good search algorithm for a problem. Wolpert and Macready's No Free Lunch theorem proves that no search algorithm is better than any other over all possible discrete functions. We elaborate on the No Free Lunch theorem by proving th...
متن کاملRepresentation , Search and Genetic
Wolpert and Macready's No Free Lunch theorem proves that no search algorithm is better than any other over all possible discrete functions. The meaning of the No Free Lunch theorem has, however, been the subject of intense debate. We prove that for local neighborhood search on problems of bounded complexity, where complexity is measured in terms of number of basins of attraction in the search s...
متن کامل